Errata to " Hyperplane Arrangements and Descent Algebras "

نویسندگان

  • Franco V Saliola
  • Darij Grinberg
چکیده

Hyperplane arrangements and descent algebras Franco V Saliola saliola-DesAlgLectureNotes.pdf version of 10 January 2006 Errata and addenda by Darij Grinberg I will refer to the results appearing in the article " A Hyperplane arrangements and descent algebras " by the numbers under which they appear in this article. 6. Errata • Various places (for example, §2.1): You use the notations ⊆ and ⊂ synonymously. It might be better if you consistently keep to one of them, as the appearance of both of them in your notes suggests that ⊂ means proper inclusion (but it does not). • Page 3: Replace " the nonempty intersections of the open half spaces " by " a nonempty intersection of open half spaces ". (Maybe also add " (one for each hyperplane) " at the end of the sentence.) • Page 4, Figure 3: I think the " (+0−) " label is wrong, and should be a " (−0−) " label instead. • Page 4: Replace " and that the closure " by " and that the closures ". • Page 5, §1.3: Your claim that " the join X ∨ Y of X and Y is X + Y " is generally false (even when A is the braid arrangement) 1. I don't think the join can be characterized this easily. (Of course, the existence of a join follows from the existence of the meet using the fact that any finite meet-semilattice having a greatest element is a lattice.) • Page 5, §1.3: I don't think your claim that " The rank of X ∈ L is the dimension of the subspace X ⊂ R d " is true. • Page 8, Exercise 2: I think it would be useful to add the following claim between (2) and (3): " x ≤ xy ". • Page 9: In the formula for σ H ij (BC), why do you write " C (j) < C (i) " instead of " C (i) > C (j) " ? Of course, this is equivalent, but it looks out of place.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Descent algebras, hyperplane arrangements, and shuffling cards. To appear

This note establishes a connection between Solomon’s descent algebras and the theory of hyperplane arrangements. It is shown that card-shuffling measures on Coxeter groups, originally defined in terms of descent algebras, have an elegant combinatorial description in terms of random walk on the chambers of hyperplane arrangements. As a corollary, a positivity conjecture of Fulman is proved.

متن کامل

Descent Algebras, Hyperplane Arrangements, and Shuuing Cards

This note establishes a connection between Solomon's descent algebras and the theory of hyperplane arrangements. It is shown that card-shu ing measures on Coxeter groups, originally de ned in terms of descent algebras, have an elegant combinatorial description in terms of randomwalk on the chambers of hyperplane arrangements. As a corollary, a positivity conjecture of Fulman is proved. 2

متن کامل

v 4 [ m at h . C O ] 1 5 Ju l 1 99 9 Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These coincide for types A,B,C, H3, and rank two groups. Both notions have the same, simple eigenvalues. The hyperplane definition is especially natural and satisfies a positivity property when W is crystallographic and the...

متن کامل

Descent Algebras , Hyperplane Arrangements , and Shuffling Cards

Abstract Two notions of riffle shuffling on finite Coxeter groups are given: one using Solomon’s descent algebra and another using random walk on chambers of hyperplane arrangements. These definitions coincide for types A,B,H3, and rank two groups. Both notions satisfy a convolution property and have the same simple eigenvalues. The hyperplane definition is especially natural and satisfies a po...

متن کامل

Free hyperplane arrangements associated to labeled rooted trees

To each labeled rooted tree is associated a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015